منابع مشابه
Imperfect quantum searching algorithm
We point out that the criterion, derived by Long et al.[Phys. Rev A 61, 042305 (2000)], to judging the degree of inaccuracy under systematic errors in phase inversions in Grover’s quantum search algorithm is overestimated. Although this criterion is properly deduced, it lacks a more accurate characterization to the relation between systematic errors and the size of a quantum database. The crite...
متن کاملA Distance-Based Block Searching Algorithm
We present in this paper an algorithm for the multiple comparison of a set of protein sequences. Our approach is that of peptide matching and consists in looking for all the words that occur approximatively in at least q of the sequences in the set, where q is a parameter. Words are compared by using a reference object called a model, that is itself a word over the alphabet of the amino acids, ...
متن کامل8.1 an Algorithm for Searching the Hierarchy
(This report discussed how to estimate the database usefulness used deened in this paper for the high-correlation and disjoint scenarios. Such discussion did not appear in 16].) 26 showed that when it is used in conjunction with any of the three estimation algorithms, the number of databases searched by this algorithm is, on the average, only slightly above the number of databases containing th...
متن کاملA Fast Algorithm for Multi-pattern Searching
A new algorithm to search for multiple patterns at the same time is presented. The algorithm is faster than previous algorithms and can support a very large number — tens of thousands — of patterns. Several applications of the multi-pattern matching problem are discussed. We argue that, in addition to previous applications that required such search, multi-pattern matching can be used in lieu of...
متن کاملSearching for Features using a Genetic Algorithm
Automatic classification of words use abstract representations of lexical items. The representations are usually not easily derived from the data available (strings of letters). This is a core problem in nearest neighbor methods. This article describes research towards a genetic algorithm for inventing features of relevance for automatic word classification. The GA attempts to optimize a repres...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 1989
ISSN: 0001-8708
DOI: 10.1016/0001-8708(89)90086-8